Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity
نویسندگان
چکیده
The average complexity of any algorithm whatsoever (provided it always terminates) under the universal distribution is of the same order of magnitude as the worst-case complexity. This holds both for time complexity and for space complexity. To focus our discussion, we use as illustrations the particular case of sorting algorithms, and the general case of the average case complexity of NP-complete problems.
منابع مشابه
Average-Case Analysis Using Kolmogorov Complexity
This expository paper demonstrates how to use Kolmogorov complexity to do the average-case analysis via four examples, and exhibits a surprising property of the celebrated associated universal distribution. The four examples are: average case analysis of Heapsort 17, 15], average nni-distance between two binary rooted leave-labeled trees 20], compact routing in computer networks 3], average-cas...
متن کاملHow robust is quicksort average complexity?
The paper questions the robustness of average case time complexity of the fast and popular quicksort algorithm. Among the six standard probability distributions examined in the paper, only continuous uniform, exponential and standard normal are supporting it whereas the others are supporting the worst case complexity measure. To the question -why are we getting the worst case complexity measure...
متن کاملTime-Bounded Universal Distributions
We show that under a reasonable hardness assumptions, the time-bounded Kolmogorov distribution is a universal samplable distribution. Under the same assumption we exactly characterize the worst-case running time of languages that are in average polynomial-time over all P-samplable distributions.
متن کاملAverage-Case Quantum Query Complexity
We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be at most polynomial. We show that for averagecase complexity under the uniform distribution, quantum algorithms can be exponentially faster than classical algorithms. Under non-uniform distributions the gap can even be super-expo...
متن کاملA Worst-Case to Average-Case Connection for CVP
We prove a connection of the worst-case complexity and the average-case complexity for the Closest Vector Problem (CVP) for lattices. Assume that there is an eecient algorithm which can solve approximately a random instance of CVP for lattices under a certain natural distribution, at least with a non-trivial success probability over this distribution, we show that one can approximately solve se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 42 شماره
صفحات -
تاریخ انتشار 1992